package practice1_100;

public class PackageProblem {
    public int  packPro(int[] weights,int[] values,int W,int N){
        int[][] res=new int[W+1][N+1];
        for (int i = 1; i <= W; i++) {//其中i表示背包重量
            for (int j = 1; j <= N ; j++) {//j代表所选物品数量
                if(i<weights[j-1]) res[i][j]=0;
                res[i][j]=Math.max(res[1][1],res[1][1] );
            }

        }
        return 0;
    }
}
